On the number of minimal transversals in 3-uniform hypergraphs
نویسندگان
چکیده
We prove that the number of minimal transversals (and also the number of maximal independent sets) in a 3-uniform hypergraph with n vertices is at most c, where c ≈ 1.6702. The best known lower bound for this number, due to Tomescu, is ad, where d = 10 1 5 ≈ 1.5849 and a is a constant.
منابع مشابه
Faster Algorithms to Enumerate Hypergraph Transversals
A transversal of a hypergraph is a set of vertices intersecting each hyperedge. We design and analyze new exponential-time algorithms to enumerate all inclusion-minimal transversals of a hypergraph. For each fixed k ≥ 3, our algorithms for hypergraphs of rank k, where the rank is the maximum size of a hyperedge, outperform the previous best. This also implies improved upper bounds on the maximu...
متن کاملTotal domination of graphs and small transversals of hypergraphs
The main result of this paper is that every 4-uniform hypergraph on n vertices and m edges has a transversal with no more than (5n+4m)/21 vertices. In the particular case n = m, the transversal has at most 3n/7 vertices, and this bound is sharp in the complement of the Fano plane. Chvátal and McDiarmid [5] proved that every 3-uniform hypergraph with n vertices and edges has a transversal of siz...
متن کاملA New Algorithm for the Hypergraph Transversal Problem
We consider the problem of finding all minimal transversals of a hypergraph H ⊆ 2 , given by an explicit list of its hyperedges. We give a new decomposition technique for solving the problem with the following advantages: (i) Global parallelism: for certain classes of hypergraphs, e.g. hypergraphs of bounded edge size, and any given integer k, the algorithm outputs k minimal transversals of H i...
متن کاملTotal Transversals and Total Domination in Uniform Hypergraphs
In 2012, the first three authors established a relationship between the transversal number and the domination number of uniform hypergraphs. In this paper, we establish a relationship between the total transversal number and the total domination number of uniform hypergraphs. We prove tight asymptotic upper bounds on the total transversal number in terms of the number of vertices, the number of...
متن کاملAn average study of hypergraphs and their minimal transversals
In this paper, we study some average properties of hypergraphs and the average complexity of algorithms applied to hypergraphs under different probabilistic models. Our approach is both theoretical and experimental since our goal is to obtain a random model that is able to capture the real-data complexity. Starting from a model that generalizes the Erdös-Renyi model [9, 10], we obtain asymptoti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 308 شماره
صفحات -
تاریخ انتشار 2008